Dynamic Inertia Weight Binary Bat Algorithm with Neighborhood Search

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Inertia Weight Binary Bat Algorithm with Neighborhood Search

Binary bat algorithm (BBA) is a binary version of the bat algorithm (BA). It has been proven that BBA is competitive compared to other binary heuristic algorithms. Since the update processes of velocity in the algorithm are consistent with BA, in some cases, this algorithm also faces the premature convergence problem. This paper proposes an improved binary bat algorithm (IBBA) to solve this pro...

متن کامل

Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm

In order to effectively solve the dynamic vehicle routing problem with time windows, the mathematical model is established and an improved variable neighborhood search algorithm is proposed. In the algorithm, allocation customers and planning routes for the initial solution are completed by the clustering method. Hybrid operators of insert and exchange are used to achieve the shaking process, t...

متن کامل

Group Search Optimizer with Interactive Dynamic Neighborhood

Group search optimizer(GSO) is a new novel optimization algorithm by simulating animal behaviour. It uses the Gbest topology structure, which leads to rapid exchange of information among particles. So,it is easily trapped into a local optima when dealing with multi-modal optimization problems. In this paper,inspiration from the Newman and Watts model,a improved group search optimizer with inter...

متن کامل

Adaptive PSO Algorithm With Non-Linearly Decreasing Inertia Weight

This paper proposes a modified particle swarm optimization method with non linearly decreasing inertia weight (MPSO-NDIW) and time varying acceleration coefficients. In this MPSO-NDIW method, proper control of the global exploration and local exploitation is done in finding the optimum solution efficiently. In the early stage, full range of search space is allowed for search by the PSO algorith...

متن کامل

Dynamic Competition with Consumer Inertia Dynamic Competition with Consumer Inertia

We study a framework where two duopolists compete repeatedly in prices and where chosen prices potentially affect future market shares, but certainly do not affect current sales. This assumption of consumer inertia causes (noncooperative) coordination on high prices only to be possible as an equilibrium for low values of the discount factor. In particular, high discount factors increase opportu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Intelligence and Neuroscience

سال: 2017

ISSN: 1687-5265,1687-5273

DOI: 10.1155/2017/3235720